A nearest neighbor characterization of Lebesgue points in metric measure spaces
نویسندگان
چکیده
منابع مشابه
Active Nearest-Neighbor Learning in Metric Spaces
We propose a pool-based non-parametric active learning algorithm for general metric spaces, called MArgin Regularized Metric Active Nearest Neighbor (MARMANN), which outputs a nearest-neighbor classifier. We give prediction error guarantees that depend on the noisy-margin properties of the input sample, and are competitive with those obtained by previously proposed passive learners. We prove th...
متن کاملPractical Construction of k-Nearest Neighbor Graphs in Metric Spaces
Let U be a set of elements and d a distance function defined among them. Let NNk(u) be the k elements in U−{u} having the smallest distance to u. The k-nearest neighbor graph (knng) is a weighted directed graph G(U, E) such that E = {(u, v), v ∈ NNk(u)}. Several knng construction algorithms are known, but they are not suitable to general metric spaces. We present a general methodology to constr...
متن کاملNearest neighbor search in metric spaces through Content-Addressable Networks
Most of the Peer-to-Peer search techniques proposed in the recent years have focused on the single-key retrieval. However, similarity search in metric spaces represents an important paradigm for content-based retrieval in many applications. In this paper we introduce an extension of the well-known Content-Addressable Network paradigm to support storage and retrieval of more generic metric space...
متن کاملAdaptive Metric nearest Neighbor Classification
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with finite samples due to the curse of dimensionality. Severe bias can be introduced under these conditions when using the nearest neighbor rule. We propose a locally adaptive nearest neighbor classification method to try to minimize bias. We use a Chisqu...
متن کاملk-Nearest neighbor searching in hybrid spaces
Little work has been reported in the literature to support k-nearest neighbor (k-NN) searches/ queries in hybrid data spaces (HDS). An HDS is composed of a combination of continuous and non-ordered discrete dimensions. This combination presents new challenges in data organization and search ordering. In this paper, we present an algorithm for k-NN searches using a stages and use the properties ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Statistics and Learning
سال: 2021
ISSN: 2520-2316
DOI: 10.4171/msl/19